例句與造句

1. Cartesian trees can be constructed in linear time.
2. Another linear-time algorithm for Cartesian tree construction is based on divide-and-conquer.
3. Once the minimum spanning tree has been found and its edge weights sorted, the Cartesian tree may be constructed in linear time.
4. To look up results efficiently, the Cartesian tree ( row ) corresponding to a specific block must be addressable in constant time.
5. From the minimum spanning tree, one can construct a Cartesian tree, the root node of which represents the heaviest edge of the minimum spanning tree.
6. It's difficult to find cartesian tree in a sentence. 用cartesian tree造句挺難的
7. As had been previously observed by, the range minimum problem can in turn be transformed back into a lowest common ancestor problem using the technique of Cartesian trees.
8. The left and right neighbors may also be constructed efficiently by parallel algorithms, so this formulation may be used to develop efficient parallel algorithms for Cartesian tree construction.
9. Removing this edge partitions the minimum spanning tree into two subtrees, and Cartesian trees recursively constructed for these two subtrees form the children of the root node of the Cartesian tree.
10. Removing this edge partitions the minimum spanning tree into two subtrees, and Cartesian trees recursively constructed for these two subtrees form the children of the root node of the Cartesian tree.
11. This can be achieved by doing a breadth-first-search through the tree and adding leave nodes so that every existing node in the Cartesian tree has exactly two children.
12. Although more efficient construction algorithms are known, it is helpful to think of a Cartesian tree as being constructed by inserting the given numbers into a binary search tree in priority order.
13. Along with the definitions in terms of continued fractions and mediants described above, the Stern Brocot tree may also be defined as a Cartesian tree for the rational numbers, prioritized by their denominators.
14. The parent of " x " in the Cartesian tree is either the left neighbor of " x " or the right neighbor of " x ", whichever exists and has a larger value.
15. The same construction, of lowest common ancestors in a Cartesian tree, makes it possible to construct a data structure with linear space that allows the distances between pairs of points in any ultrametric space to be queried in constant time per query.
16. In computer science, a "'Cartesian tree "'is a binary tree derived from a sequence of numbers; it can be uniquely defined from the properties that it is stack-based algorithm for finding all nearest smaller values in a sequence.
更多例句：  下一頁